An upper bound for graphs of diameter 3 and given degree obtained as abelian lifts of dipoles
نویسنده
چکیده
We derive an upper bound on the number of vertices in graphs of diameter 3 and given degree arising from Abelian lifts of dipoles with loops and multiple edges.
منابع مشابه
A Moore-like Bound for Graphs of Diameter 2 and given Degree, Obtained as Abelian Lifts of Dipoles
In this note we prove a Moore-like bound for graphs of diameter two and given degree which arise as lifts of dipoles with loops and multiple edges, with voltage assignments in Abelian groups.
متن کاملLarge vertex-transitive and Cayley graphs with given degree and diameter
We present an upper bound on the number of vertices in graphs of given degree and diameter 3 that arise as lifts of dipoles with voltage assignments in Abelian groups. Further, we construct a family of Cayley graphs of degree d = 3m− 1 and diameter k ≥ 3 of order kmk. By comparison with other available results in this area we show that, for sufficiently large d and k such that k ≤ d − 2, our fa...
متن کاملSharp Upper bounds for Multiplicative Version of Degree Distance and Multiplicative Version of Gutman Index of Some Products of Graphs
In $1994,$ degree distance of a graph was introduced by Dobrynin, Kochetova and Gutman. And Gutman proposed the Gutman index of a graph in $1994.$ In this paper, we introduce the concepts of multiplicative version of degree distance and the multiplicative version of Gutman index of a graph. We find the sharp upper bound for the multiplicative version of degree distance and multiplicative ver...
متن کاملA Moore-like bound for mixed abelian Cayley graphs
We give an upper bound for the number of vertices in mixed abelian Cayley graphs with given degree and diameter.
متن کاملA generalization of zero-divisor graphs
In this paper, we introduce a family of graphs which is a generalization of zero-divisor graphs and compute an upper-bound for the diameter of such graphs. We also investigate their cycles and cores
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discussiones Mathematicae Graph Theory
دوره 28 شماره
صفحات -
تاریخ انتشار 2008